Balancing Academic Curriculum Problem Solution: A Discrete Firefly-Based Approach

نویسندگان

چکیده

The difficulty of allocating a balanced educational syllabus to academic periods curriculum, also known as curriculum balancing, has long been source consternation for any institution higher education attempting connect learners and teachers. challenge entails assigning courses times while adhering all load restrictions prerequisite requirements. problem (BACP) includes subjects class hours that fulfill standards even managing students’ burden in terms credits, course load, perquisites covered the previous semesters/periods. number credits every semester corresponds load. As result, frameworks must be “balanced,” which means each period should equivalent order students bear minimum work. it is desirable reduce this cost by developing study plan employs an algorithm conducts work automatically. Using optimization method, article provides solution curricula balancing based on discrete firefly (DFA). In research, FA already used solve BACP problem. However, basic modified DFA with local search mechanism inbuilt helps reach optimum less iterations. A series tests standard real data instances are done check efficiency suggested approach, objective producing platform would simplify procedure building system at institutions learning. results show proposed obtained rather rapid hit recognized most

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A CP Approach to the Balanced Academic Curriculum Problem

The Balanced Academic Curriculum Problem (BACP) has received little attention in Constraint Programming. Only a few articles deals with this problem with experimental results on the three small instances publicly available in CSPLIB. The present article describes an approach to efficiently solve this challenging problem. Optimal solutions are produced on a variety of randomly generated instance...

متن کامل

A Tabu Search Based Solution Approach to the Competitive Multiple Allocation Hub Location Problem

The hub location problems (HLP) constitute an important class of facility location problems that have been addressed by numerous operations researchers in recent years. HLP is a strategic problem frequently encountered in designing logistics and transportation networks. Here, we address the competitive multiple allocation HLP in a duopoly market. It is assumed that an incumbent firm (the leader...

متن کامل

Curriculum Development Using Problem Based Learning Techniques

The ultimate purpose in designing a Curriculum should be to have an organized system of what is to be learned when an area of study is identified. The Curriculum Development should be designed in such a way that even the beginners are able to get a complete idea of the subject over a period of time on learning it. The curriculum should be as of that it should make him/her to get involved in kno...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Education Research International

سال: 2023

ISSN: ['2090-4010', '2090-4002']

DOI: https://doi.org/10.1155/2023/4300472